Picking a Pooling

نویسندگان

  • Brandon Burdge
  • Ken Kreutz-Delgado
  • Richard Rohwer
چکیده

We introduce a concept we call “mutual metainformation” as a criterion for determining the maximum statistically significant number of clusters in distributional clustering problems. In distributional clustering, one has data drawn from an ensemble of probability distributions and seeks to group similar distributions together. We focus on the case of multinomials, such as a set of biased coins to be organized into groups with similar bias, given count data from a finite number of tosses of each coin. If one knew in advance the number of groups and which coins belonged to which, one could pool the count data accordingly and perform a Bayesian estimate of each bias using a prior, such as a Dirichlet in the case of a multinomial distribution. When the correct pooling is unknown, the Bayesian approach to this more difficult problem is to extend the method by placing a prior (such as the Chinese Restaurant Process) on the number of clusters and their membership. Our method falls intermediate between a full Bayesian expression on all parameters, and a non-Bayesian approach. It allows a direct expression of the intuition that one merely wants to obtain as many clusters as would turn out to be statistically significant, a posteriori, without further prejudice as to what that number should be. We report numerical experiments with artificial data that support the validity of the approach.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Max-Pooling Dropout for Regularization of Convolutional Neural Networks

Recently, dropout has seen increasing use in deep learning. For deep convolutional neural networks, dropout is known to work well in fully-connected layers. However, its effect in pooling layers is still not clear. This paper demonstrates that max-pooling dropout is equivalent to randomly picking activation based on a multinomial distribution at training time. In light of this insight, we advoc...

متن کامل

Stochastic Pooling for Regularization of Deep Convolutional Neural Networks

We introduce a simple and effective method for regularizing large convolutional neural networks. We replace the conventional deterministic pooling operations with a stochastic procedure, randomly picking the activation within each pooling region according to a multinomial distribution, given by the activities within the pooling region. The approach is hyper-parameter free and can be combined wi...

متن کامل

Towards dropout training for convolutional neural networks

Recently, dropout has seen increasing use in deep learning. For deep convolutional neural networks, dropout is known to work well in fully-connected layers. However, its effect in convolutional and pooling layers is still not clear. This paper demonstrates that max-pooling dropout is equivalent to randomly picking activation based on a multinomial distribution at training time. In light of this...

متن کامل

The Pooled NBNN Kernel: Beyond Image-to-Class and Image-to-Image

While most image classification methods to date are based on image-to-image comparisons, Boiman et al. have shown that better generalization can be obtained by performing image-to-class comparisons. Here, we show that these are just two special cases of a more general formulation, where the feature space is partitioned into subsets of different granularity. This way, a series of representations...

متن کامل

A Novel Portable Scissors-Type Fruit Picking Device

At present, the fruit picking in most countries still largely relies on manual operation. Manual fruit picking can protect the fruits from damage during the operation process. However, it is time-consuming and labor-intensive, and poses a potential safety risk to the workers while working at heights not reachable. Therefore, a variety of fruit picking machines and platforms have been developed ...

متن کامل

Integrated Order Batching and Distribution Scheduling in a Single-block Order Picking Warehouse Considering S-Shape Routing Policy

In this paper, a mixed-integer linear programming model is proposed to integrate batch picking and distribution scheduling problems in order to optimize them simultaneously in an order picking warehouse. A tow-phase heuristic algorithm is presented to solve it in reasonable time. The first phase uses a genetic algorithm to evaluate and select permutations of the given set of customers. The seco...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007